High Multiplicity Scheduling Problems

نویسندگان

  • Alexander Grigoriev
  • Corinne Feremans
  • Sonja Kovaleva
  • Rudolf Müller
چکیده

These four years proved to be a very interesting and enjoyable period of my life. I was introduced to the international research community and visited many scientific events in different parts of the world. First of all, I want to heartily thank my supervisors, Antoon Kolen, Yves Crama, and Joris van de Klundert, for haven given me the opportunity to join the scientific world and academic community, for their support, their trust and their continuous advise. This thesis would never exist without the contribution of these people. I feel much indebted also to Gerhard Woeginger, Frits Spieksma, and Nadia Brauner. Many results of this thesis were written in joint papers and for me it was a big pleasure to work with them. I am also thankful to Wieslaw Kubiak, Renato Monteiro, Leen Stougie, and Jos Sturm for reading the drafts of my papers, for their comments and for providing me with many useful references. I want to thank Stan van Hoesel, Marc Uetz, and Vitaly Strusevich for awakening and developing my interests in many other fields of combinatorial optimization other than high multiplicity scheduling. My thanks go to Roel Romero for the discussions on numerous topics in operations research and combinatorial optimization. I am grateful to my Russian colleagues, teachers and friends, Erik Rulands for creating a nice atmosphere where I was able to work effectively and write the thesis in time. Finally, I address my warm thanks to my wife, my parents and my son for their moral support during these four years.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Framework for the Complexity of High-Multiplicity Scheduling Problems

The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of outputsensitive complexity measures for the analysis of algorithms which produce “large” outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as rel...

متن کامل

A Polynomial Algorithm for Multiprocessor Scheduling

The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for aircraft. Each maintenance period is a job, and the maintenance facilities are machines. In this context, there are very few different types of maintenances performed, so it is natural to consider the problem with only a small, fixed number C of different types of jobs. Each job type has a proces...

متن کامل

From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective

We design an algorithm for the high-multiplicity job-shop scheduling problem with the objective of minimizing the total holding cost by appropriately rounding an optimal solution to a fluid relaxation in which we replace discrete jobs with the flow of a continuous fluid. The algorithm solves the fluid relaxation optimally and then aims to keep the schedule in the discrete network close to the s...

متن کامل

Exact and approximate algorithms for high-multiplicity parallel machine scheduling

In many scheduling applications, a large number of jobs are grouped into a comparatively small number of lots, made of identical items. It is then sufficient to give, for each lot, the number of jobs it involves plus the description of one single job. The resulting high-multiplicity input format is much more compact than the standard one. As a consequence, in order to be efficient, standard sol...

متن کامل

Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming

We consider the parallel approximability of two problems arising from High Multiplicity Scheduling, namely theUnweighted Model with Variable Processing Requirements and the Weighted Model with Identical Processing Requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are...

متن کامل

Polynomiality for Bin Packing with a Constant Number of Item Types

We consider the bin packing problem with d different item sizes si and item multiplicities ai, where all numbers are given in binary encoding. This problem formulation is also known as the 1-dimensional cutting stock problem. In this work, we provide an algorithm which, for constant d, solves bin packing in polynomial time. This was an open problem for all d ≥ 3. In fact, for constant d our alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003